0.09/0.14 % Problem : SLH691^1 : TPTP v7.5.0. Released v7.5.0. 0.09/0.16 % Command : run_E %s %d THM 0.16/0.37 % Computer : n004.cluster.edu 0.16/0.37 % Model : x86_64 x86_64 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.16/0.37 % Memory : 8042.1875MB 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64 0.16/0.37 % CPULimit : 30 0.16/0.37 % WCLimit : 30 0.16/0.37 % DateTime : Tue Aug 9 03:24:35 EDT 2022 0.16/0.37 % CPUTime : 0.23/0.52 The problem SPC is TH0_THM_EQU_NAR 0.23/0.52 Running higher-order on 1 cores theorem proving 0.23/0.52 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.23/0.52 # Version: 3.0pre003-ho 0.37/0.64 # Preprocessing class: HSLSSMSSSSSNHSA. 0.37/0.64 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.37/0.64 # Starting full_lambda_9 with 30s (1) cores 0.37/0.64 # full_lambda_9 with pid 14014 completed with status 0 0.37/0.64 # Result found by full_lambda_9 0.37/0.64 # Preprocessing class: HSLSSMSSSSSNHSA. 0.37/0.64 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.37/0.64 # Starting full_lambda_9 with 30s (1) cores 0.37/0.64 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 0.37/0.64 # ...ProofStateSinE()=247/300 0.37/0.64 # Search class: HGHSM-FSLM31-DHSFFSBN 0.37/0.64 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.37/0.64 # Starting ehoh_best2 with 17s (1) cores 0.37/0.64 # ehoh_best2 with pid 14015 completed with status 0 0.37/0.64 # Result found by ehoh_best2 0.37/0.64 # Preprocessing class: HSLSSMSSSSSNHSA. 0.37/0.64 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.37/0.64 # Starting full_lambda_9 with 30s (1) cores 0.37/0.64 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 0.37/0.64 # ...ProofStateSinE()=247/300 0.37/0.64 # Search class: HGHSM-FSLM31-DHSFFSBN 0.37/0.64 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.37/0.64 # Starting ehoh_best2 with 17s (1) cores 0.37/0.64 # Preprocessing time : 0.006 s 0.37/0.64 0.37/0.64 # Proof found! 0.37/0.64 # SZS status Theorem 0.37/0.64 # SZS output start CNFRefutation 0.37/0.64 thf(decl_22, type, minus_minus_nat: nat > nat > nat). 0.37/0.64 thf(decl_23, type, zero_zero_nat: nat). 0.37/0.64 thf(decl_24, type, list_asc_nat: list_nat > $o). 0.37/0.64 thf(decl_25, type, list_desc_nat: list_nat > $o). 0.37/0.64 thf(decl_26, type, list_strict_asc_nat: list_nat > $o). 0.37/0.64 thf(decl_27, type, list_strict_desc_nat: list_nat > $o). 0.37/0.64 thf(decl_28, type, listIn923761578nd_nat: list_nat > (nat > nat) > nat > nat). 0.37/0.64 thf(decl_29, type, listIn1312259492pend_a: list_a > (nat > a) > nat > a). 0.37/0.64 thf(decl_30, type, listIn1417627087drop_a: nat > (nat > a) > nat > a). 0.37/0.64 thf(decl_31, type, listIn1299132951ke_nat: nat > (nat > nat) > list_nat). 0.37/0.64 thf(decl_32, type, listIn84854903take_a: nat > (nat > a) > list_a). 0.37/0.64 thf(decl_33, type, last_nat: list_nat > nat). 0.37/0.64 thf(decl_34, type, last_a: list_a > a). 0.37/0.64 thf(decl_35, type, nil_nat: list_nat). 0.37/0.64 thf(decl_36, type, nil_a: list_a). 0.37/0.64 thf(decl_37, type, nth_nat: list_nat > nat > nat). 0.37/0.64 thf(decl_38, type, nth_a: list_a > nat > a). 0.37/0.64 thf(decl_39, type, take_nat: nat > list_nat > list_nat). 0.37/0.64 thf(decl_40, type, take_a: nat > list_a > list_a). 0.37/0.64 thf(decl_41, type, suc: nat > nat). 0.37/0.64 thf(decl_42, type, size_size_list_nat: list_nat > nat). 0.37/0.64 thf(decl_43, type, size_size_list_a: list_a > nat). 0.37/0.64 thf(decl_44, type, ord_less_nat: nat > nat > $o). 0.37/0.64 thf(decl_45, type, ord_less_eq_nat: nat > nat > $o). 0.37/0.64 thf(decl_46, type, ord_min_nat: nat > nat > nat). 0.37/0.64 thf(decl_47, type, f: nat > a). 0.37/0.64 thf(decl_48, type, g: nat > a). 0.37/0.64 thf(decl_49, type, esk1_1: nat > list_a). 0.37/0.64 thf(decl_50, type, esk2_1: (list_a > $o) > list_a). 0.37/0.64 thf(decl_51, type, esk3_2: nat > (nat > a > $o) > nat). 0.37/0.64 thf(decl_52, type, esk4_2: nat > (nat > a > $o) > list_a). 0.37/0.64 thf(decl_53, type, esk5_3: nat > (nat > a > $o) > list_a > nat). 0.37/0.64 thf(decl_54, type, esk6_3: nat > (nat > a > $o) > nat > a). 0.37/0.64 thf(decl_55, type, esk7_2: list_a > list_a > nat). 0.37/0.64 thf(decl_56, type, esk8_3: nat > list_a > list_a > nat). 0.37/0.64 thf(decl_57, type, esk9_1: nat > nat). 0.37/0.64 thf(decl_58, type, esk10_1: (nat > $o) > nat). 0.37/0.64 thf(decl_59, type, esk11_1: nat > nat). 0.37/0.64 thf(decl_60, type, esk12_1: (nat > $o) > nat). 0.37/0.64 thf(decl_61, type, esk13_1: (nat > nat > $o) > nat). 0.37/0.64 thf(decl_62, type, esk14_1: (nat > nat > $o) > nat). 0.37/0.64 thf(decl_63, type, esk15_1: (nat > nat > $o) > nat). 0.37/0.64 thf(decl_64, type, esk16_1: (nat > nat > $o) > nat). 0.37/0.64 thf(decl_65, type, esk17_1: (nat > $o) > nat). 0.37/0.64 thf(decl_66, type, esk18_1: (nat > $o) > nat). 0.37/0.64 thf(decl_67, type, esk19_2: nat > nat > nat). 0.37/0.64 thf(decl_68, type, esk20_1: nat > nat). 0.37/0.64 thf(decl_69, type, esk21_2: nat > (nat > $o) > nat). 0.37/0.64 thf(decl_70, type, esk22_2: nat > (nat > $o) > nat). 0.37/0.64 thf(decl_71, type, esk23_1: nat > nat). 0.37/0.64 thf(decl_72, type, esk24_2: nat > (nat > $o) > nat). 0.37/0.64 thf(decl_73, type, esk25_2: nat > (nat > $o) > nat). 0.37/0.64 thf(decl_74, type, esk26_2: (nat > $o) > nat > nat). 0.37/0.64 thf(decl_75, type, esk27_2: (nat > $o) > nat > nat). 0.37/0.64 thf(decl_76, type, esk28_1: (nat > $o) > nat). 0.37/0.64 thf(decl_77, type, esk29_1: (nat > $o) > nat). 0.37/0.64 thf(decl_78, type, esk30_3: nat > nat > (nat > $o) > nat). 0.37/0.64 thf(decl_79, type, esk31_3: nat > nat > (nat > $o) > nat). 0.37/0.64 thf(decl_80, type, esk32_3: nat > nat > (nat > nat > $o) > nat). 0.37/0.64 thf(decl_81, type, esk33_3: nat > nat > (nat > nat > $o) > nat). 0.37/0.64 thf(decl_82, type, esk34_3: nat > nat > (nat > nat > $o) > nat). 0.37/0.64 thf(decl_83, type, esk35_3: nat > nat > (nat > nat > $o) > nat). 0.37/0.64 thf(decl_84, type, esk36_2: nat > nat > nat). 0.37/0.64 thf(decl_85, type, esk37_2: nat > (nat > $o) > nat). 0.37/0.64 thf(decl_86, type, esk38_2: nat > (nat > $o) > nat). 0.37/0.64 thf(decl_87, type, esk39_2: nat > (nat > $o) > nat). 0.37/0.64 thf(decl_88, type, esk40_2: nat > (nat > $o) > nat). 0.37/0.64 thf(decl_89, type, esk41_2: nat > nat > nat). 0.37/0.64 thf(decl_90, type, esk42_2: nat > nat > nat). 0.37/0.64 thf(decl_91, type, esk43_1: (nat > nat) > nat). 0.37/0.64 thf(decl_92, type, esk44_1: (nat > nat) > nat). 0.37/0.64 thf(decl_93, type, esk45_1: (list_nat > $o) > list_nat). 0.37/0.64 thf(decl_94, type, esk46_1: (nat > nat) > nat). 0.37/0.64 thf(decl_95, type, esk47_1: (nat > nat) > nat). 0.37/0.64 thf(decl_96, type, esk48_3: nat > nat > (nat > $o) > nat). 0.37/0.64 thf(decl_97, type, esk49_3: nat > nat > (nat > $o) > nat). 0.37/0.64 thf(decl_98, type, esk50_2: list_a > list_a > nat). 0.37/0.64 thf(decl_99, type, esk51_2: (nat > $o) > nat > nat). 0.37/0.64 thf(decl_100, type, esk52_1: (nat > $o) > nat). 0.37/0.64 thf(decl_101, type, esk53_3: nat > nat > (nat > nat > $o) > nat). 0.37/0.64 thf(decl_102, type, esk54_3: nat > nat > (nat > nat > $o) > nat). 0.37/0.64 thf(decl_103, type, esk55_3: nat > nat > (nat > nat > $o) > nat). 0.37/0.64 thf(decl_104, type, esk56_3: nat > nat > (nat > nat > $o) > nat). 0.37/0.64 thf(decl_105, type, esk57_3: nat > nat > (nat > nat > $o) > nat). 0.37/0.64 thf(decl_106, type, esk58_3: nat > nat > (nat > $o) > nat). 0.37/0.64 thf(decl_107, type, esk59_1: (nat > $o) > nat). 0.37/0.64 thf(decl_108, type, esk60_2: nat > nat > nat). 0.37/0.64 thf(decl_109, type, esk61_1: (nat > nat) > nat). 0.37/0.64 thf(decl_110, type, esk62_1: (nat > nat) > nat). 0.37/0.64 thf(decl_111, type, esk63_1: nat > list_nat). 0.37/0.64 thf(decl_112, type, esk64_2: nat > (nat > nat > $o) > nat). 0.37/0.64 thf(decl_113, type, esk65_2: nat > (nat > nat > $o) > list_nat). 0.37/0.64 thf(decl_114, type, esk66_3: nat > (nat > nat > $o) > list_nat > nat). 0.37/0.64 thf(decl_115, type, esk67_3: nat > (nat > nat > $o) > nat > nat). 0.37/0.64 thf(decl_116, type, esk68_2: list_nat > list_nat > nat). 0.37/0.64 thf(decl_117, type, esk69_3: nat > list_nat > list_nat > nat). 0.37/0.64 thf(decl_118, type, esk70_0: nat). 0.37/0.64 thf(decl_119, type, esk71_3: list_a > (nat > a) > (nat > a) > nat). 0.37/0.64 thf(decl_120, type, esk72_4: list_a > list_a > (nat > a) > (nat > a) > nat). 0.37/0.64 thf(decl_121, type, esk73_4: list_a > list_a > (nat > a) > (nat > a) > nat). 0.37/0.64 thf(decl_122, type, esk74_3: nat > (nat > a) > (nat > a) > nat). 0.37/0.64 thf(conj_1, conjecture, ((f)=(g)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_1)). 0.37/0.64 thf(fact_9_last__i__take, axiom, ![X1:nat, X2:nat > a]:(((last_a @ (listIn84854903take_a @ (suc @ X1) @ X2))=(X2 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_9_last__i__take)). 0.37/0.64 thf(conj_0, hypothesis, ![X127:nat]:(((listIn84854903take_a @ X127 @ f)=(listIn84854903take_a @ X127 @ g))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.37/0.64 thf(c_0_3, negated_conjecture, ((f)!=(g)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])])). 0.37/0.64 thf(c_0_4, plain, ![X1195:nat, X1196:nat > a]:(((last_a @ (listIn84854903take_a @ (suc @ X1195) @ X1196))=(X1196 @ X1195))), inference(variable_rename,[status(thm)],[fact_9_last__i__take])). 0.37/0.64 thf(c_0_5, hypothesis, ![X662:nat]:(((listIn84854903take_a @ X662 @ f)=(listIn84854903take_a @ X662 @ g))), inference(variable_rename,[status(thm)],[conj_0])). 0.37/0.64 thf(c_0_6, negated_conjecture, ((f)!=(g)), inference(split_conjunct,[status(thm)],[c_0_3])). 0.37/0.64 thf(c_0_7, plain, ![X2:nat > a, X1:nat]:(((last_a @ (listIn84854903take_a @ (suc @ X1) @ X2))=(X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_4])). 0.37/0.64 thf(c_0_8, hypothesis, ![X1:nat]:(((listIn84854903take_a @ X1 @ f)=(listIn84854903take_a @ X1 @ g))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.37/0.64 thf(c_0_9, negated_conjecture, ((f @ esk70_0)!=(g @ esk70_0)), inference(neg_ext,[status(thm)],[c_0_6])). 0.37/0.64 thf(c_0_10, hypothesis, ![X1:nat]:(((f @ X1)=(g @ X1))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_7])). 0.37/0.64 thf(c_0_11, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10])]), ['proof']). 0.37/0.64 # SZS output end CNFRefutation 0.37/0.64 # Parsed axioms : 300 0.37/0.64 # Removed by relevancy pruning/SinE : 53 0.37/0.64 # Initial clauses : 390 0.37/0.64 # Removed in clause preprocessing : 11 0.37/0.64 # Initial clauses in saturation : 379 0.37/0.64 # Processed clauses : 382 0.37/0.64 # ...of these trivial : 9 0.37/0.64 # ...subsumed : 51 0.37/0.64 # ...remaining for further processing : 322 0.37/0.64 # Other redundant clauses eliminated : 97 0.37/0.64 # Clauses deleted for lack of memory : 0 0.37/0.64 # Backward-subsumed : 0 0.37/0.64 # Backward-rewritten : 2 0.37/0.64 # Generated clauses : 3082 0.37/0.64 # ...of the previous two non-redundant : 2698 0.37/0.64 # ...aggressively subsumed : 0 0.37/0.64 # Contextual simplify-reflections : 1 0.37/0.64 # Paramodulations : 2913 0.37/0.64 # Factorizations : 6 0.37/0.64 # NegExts : 5 0.37/0.64 # Equation resolutions : 112 0.37/0.64 # Propositional unsat checks : 0 0.37/0.64 # Propositional check models : 0 0.37/0.64 # Propositional check unsatisfiable : 0 0.37/0.64 # Propositional clauses : 0 0.37/0.64 # Propositional clauses after purity: 0 0.37/0.64 # Propositional unsat core size : 0 0.37/0.64 # Propositional preprocessing time : 0.000 0.37/0.64 # Propositional encoding time : 0.000 0.37/0.64 # Propositional solver time : 0.000 0.37/0.64 # Success case prop preproc time : 0.000 0.37/0.64 # Success case prop encoding time : 0.000 0.37/0.64 # Success case prop solver time : 0.000 0.37/0.64 # Current number of processed clauses : 274 0.37/0.64 # Positive orientable unit clauses : 53 0.37/0.64 # Positive unorientable unit clauses: 1 0.37/0.64 # Negative unit clauses : 6 0.37/0.64 # Non-unit-clauses : 214 0.37/0.64 # Current number of unprocessed clauses: 2695 0.37/0.64 # ...number of literals in the above : 8259 0.37/0.64 # Current number of archived formulas : 0 0.37/0.64 # Current number of archived clauses : 2 0.37/0.64 # Clause-clause subsumption calls (NU) : 11632 0.37/0.64 # Rec. Clause-clause subsumption calls : 7413 0.37/0.64 # Non-unit clause-clause subsumptions : 41 0.37/0.64 # Unit Clause-clause subsumption calls : 438 0.37/0.64 # Rewrite failures with RHS unbound : 0 0.37/0.64 # BW rewrite match attempts : 23 0.37/0.64 # BW rewrite match successes : 6 0.37/0.64 # Condensation attempts : 0 0.37/0.64 # Condensation successes : 0 0.37/0.64 # Termbank termtop insertions : 65844 0.37/0.64 0.37/0.64 # ------------------------------------------------- 0.37/0.64 # User time : 0.096 s 0.37/0.64 # System time : 0.012 s 0.37/0.64 # Total time : 0.108 s 0.37/0.64 # Maximum resident set size: 3472 pages 0.37/0.64 0.37/0.64 # ------------------------------------------------- 0.37/0.64 # User time : 0.105 s 0.37/0.64 # System time : 0.013 s 0.37/0.64 # Total time : 0.118 s 0.37/0.64 # Maximum resident set size: 2036 pages 0.37/0.64 EOF